Completeness of hyper-resolution via the semantics of disjunctive logic programs
نویسندگان
چکیده
We present a proof of completeness of hyper-resolution based on the fixpoint semantics of disjunctive logic programs. This shows that hyperresolution can be studied from the point of view of logic programming.
منابع مشابه
Negative Hyper-resolution as Procedural Semantics of Disjunctive Logic Programs
We prove that negative hyper-resolution is a sound and complete procedure for answering queries in disjunctive logic programs. In our formulation, answers of queries are defined using disjunctive substitutions, which are more flexible than answer literals used in theorem
متن کاملCalculi for Disjunctive Logic Programming
In this paper we investigate relationships between top-down and bottomup approaches to computation with disjunctive logic programs (DLPs). The bottom-up calculus considered, hyper tableaux, is depicted in its ground version and its relation to fixed point approaches from the literature is investigated. For the top-down calculus we use restart model elimination (RME) and show as our main result ...
متن کاملClausal Logic and Logic Programming in Algebraic Domains
We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics for disjunctive logic programs, and pro...
متن کاملClause-logical Aspects of the Smyth Powerdomain
Synopsis. In this paper we study the logical aspects of the Smyth powerdomain via clausal theories. The clause-theoretic view leads to an unexpectedly simple, operational, representation of the Smyth powerdomain. At the heart of this representation is a hyperresolution rule, whose completeness hinges upon a combinatorial lemma for the book-keeping of intermediate clauses. These results are moti...
متن کاملGame semantics of disjunctive logic programming
Denotational semantics of logic programming and its extensions (by allowing negation, disjunctions, or both) have been studied thoroughly for many years. In 1998, game semantics were given to definite logic programs by Di Cosmo, Loddo, and Nicolet, and a few years later they were extended to deal with negation by Rondogiannis and Wadge. Both approaches were proven equivalent with the traditiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 95 شماره
صفحات -
تاریخ انتشار 2005